Computation of least order solutions of linear rational equations A . Varga

On Computing Least Order Fault Detectors Using Rational Nullspace Bases

We propose a numerically reliable computational approach to design least order fault detectors using descriptor system techniques. This approach is based on a new numerically stable algorithm to compute least order rational nullspace bases of rational matrices. The main computation in this algorithm is the orthogonal reduction of the system pencil matrix to a Kronecker-like form. The proposed a...

New Computational Approach for the Design of Fault Detection and Isolation Filters

We propose a numerically reliable computational approach for the design of residual generators for fault detection and isolation filters. The new approach is based on computing solutions of least dynamical orders of linear equations with rational matrix coefficients in combination with special rational factorizations. The main computational ingredients are the orthogonal reduction of the associ...

Least Squares Solutions of Inconsistent Fuzzy Linear Matrix Equations

Computation of All Rational Solutions of First-Order Algebraic ODEs

In this paper, we consider the class of first-order algebraic ordinary differential equations (AODEs), and study their rational solutions in three different approaches. A combinatorial approach gives a degree bound for rational solutions of a class of AODEs which do not have movable poles. Algebraic considerations yield an algorithm for computing rational solutions of quasilinear AODEs. And fin...

Computation of Minimal Realizations of Periodic Systems

We propose balancing related numerically reliable methods to compute minimal realizations of linear periodic systems with time-varying dimensions. The first method belongs to the family of square-root methods with guaranteed enhanced computational accuracy and can be used to compute balanced minimal order realizations. An alternative balancing-free square-root method has the advantage of a pote...